Approximate Polynomial Preconditioning Applied to Biharmonic Equations on Vector Supercomputers

نویسنده

  • Shu Wong
چکیده

SUMMARY Applying a finite difference approximation to a biharmonic equation results in a very ill-conditioned system of equations. This paper examines the conjugate gradient method ' used in con junction with the generalized and approximate polynomial preconditionings for solving such linear systems. An approximate polynomial preconditioning is introduced, and is shown to be more efficient than the generalized polynomial preconditionings. This new technique provides a simple but effective preconditioning polynomial, which is based on another coefficient matrix rather than the original matrix operator as commonly used.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multigrid Preconditioning for the Biharmonic Dirichlet Problem

A multigrid preconditioning scheme for solving the Ciarlet-Raviart mixed method equations for the biharmonic Dirichlet problem is presented. In particular, a Schur complement formulation for these equations which yields non-inherited quadratic forms is considered. The preconditioning scheme is compared with a standard W-cycle multigrid iteration. It is proved that a Variable V-cycle preconditio...

متن کامل

A high accuracy numerical method based on spectral theory of compact operator for biharmonic eigenvalue equations

In this study, a high accuracy numerical method based on the spectral theory of compact operator for biharmonic eigenvalue equations on a spherical domain is developed. By employing the orthogonal spherical polynomials approximation and the spectral theory of compact operator, the error estimates of approximate eigenvalues and eigenfunctions are provided. By adopting orthogonal spherical base f...

متن کامل

A Numerical Approach for Solving of Two-Dimensional Linear Fredholm Integral Equations with Boubaker Polynomial Bases

In this paper, a new collocation method, which is based on Boubaker polynomials, is introduced for the approximate solutions of a class of two-dimensional linear Fredholm integral equationsof the second kind. The properties of two-dimensional Boubaker functions are presented. The fundamental matrices of integration with the collocation points are utilized to reduce the solution of the integral ...

متن کامل

Discrete weighted least-squares method for the Poisson and biharmonic problems on domains with smooth boundary

In this article a discrete weighted least-squares method for the numerical solution of elliptic partial differential equations exhibiting smooth solution is presented. It is shown how to create well-conditioned matrices of the resulting system of linear equations using algebraic polynomials, carefully selected matching points and weight factors. Two simple algorithms generating suitable matchin...

متن کامل

About the Solution of the Three-dimensional Semiconductor Device Equations on Vector-concurrent Computers

The discretization of the semiconductor equations in three-dimensional device simulators leads to very large sparse linear systems of equations. While the solution of the Poisson equation e.g. by the conjugate gradient methodis straightforward, the iterative solution of the carrier continuity equations is nontrivial due to both the non-symmetry and the poor conditioning of the coefficient matri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1989